A joint coding concept for runlength and charge-limited channels

By making the conventional (d,k) constraint time dependent as a function of the channel process, the wide sense RLL channel has been defined. With the help of the new concept several existing constraints can be described alternatively and many new ones can be constructed. A bit stuff algorithm is suggested for coding wide sense RLL channels. We determine the rate of the bit stuff algorithm as the function of the stuffing probability. We present a few examples for calculating the rate of different constrained codes complying with the newly introduced constraint